Further Combinatorial Properties of Two Fibonacci Lattices

نویسنده

  • Richard P. Stanley
چکیده

In an earlier paper on differential posets, two lattices Fib(r) and Z(r) were defined for each positive integer r, and were shown to have some interesting combinatorial properties. In this paper the investigation of Fib(r) and Z(r) is continued. A bijection 1Jf: Fib(r)--+ Z(r) is shown to preserve many properties of the lattices, though IJf is not an isomorphism. As a consequence we give an explicit formula which generalizes the rank generating function of Fib(r) and of Z(r) . Some additional properties of Fib(r) and Z(r) are developed related to the counting of chains.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ماهیت ویژه حالتهای فونون در زنجیرهای شبه تناوبی( نقش شبکه‌های فیبوناچی )

  Using the forced oscillator method (FOM) and the transfer-matrix technique, we numerically investigate the nature of the phonon states and the wave propagation, in the presence of an external force, in the chains composed of Fibonacci lattices of type site, bond and mixing models, as the quasiperiodic systems. Calculating the Lyapunov exponent and the participation ratio, we also study the lo...

متن کامل

Some Properties of the Singular Words of the Fibonacci Word

The combinatorial properties of the Fibonacci innnite word are of great interest in some aspects of mathematics and physics, such as number theory, fractal geometry, formal language, computational complexity , quasicrystals etc. In this note, we introduce the singular words of the Fibonacci innnite word and discuss their properties. We establish two decompositions of the Fibonacci word in singu...

متن کامل

A generalization of the Fibonacci word fractal and the Fibonacci snowflake

In this paper we introduce a family of infinite words that generalize the Fibonacci word and we study their combinatorial properties. We associate with this family of words a family of curves that are like the Fibonacci word fractal and reveal some fractal features. Finally, we describe an infinite family of polyominoes stems from the generalized Fibonacci words and we study some of their geome...

متن کامل

Some Properties of the (p, q)-Fibonacci and (p, q)-Lucas Polynomials

Riordan arrays are useful for solving the combinatorial sums by the help of generating functions. Many theorems can be easily proved by Riordan arrays. In this paper we consider the Pascal matrix and define a new generalization of Fibonacci polynomials called p, q -Fibonacci polynomials. We obtain combinatorial identities and by using Riordanmethodwe get factorizations of Pascal matrix involvin...

متن کامل

خواص متریک و ترکیبیاتی مکعب‌های فیبوناتچی و لوکاس

An n-dimensional hypercube, Q_n, is a graph in which vertices are binary strings of length n where two vertices are adjacent if they differ in exactly one coordinate. Hypercubes and their subgraphs have a lot of applications in different fields of science, specially in computer science. This is the reason why they have been investigated by many authors during the years. Some of their subgraphs ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Eur. J. Comb.

دوره 11  شماره 

صفحات  -

تاریخ انتشار 1990